Representable Semilattice-Ordered Monoids

نویسندگان

  • Robin Hirsch
  • Szabolcs Mikulás
چکیده

We show that no finite set of first-order axioms can define the class of representable semilattice-ordered monoids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics

We look at lower semilattice-ordered residuated semigroups and, in particular, the representable ones, i.e., those that are isomorphic to algebras of binary relations. We will evaluate expressions (terms, sequents, equations, quasi-equations) in representable algebras and give finite axiomatizations for several notions of validity. These results will be applied in the context of substructural l...

متن کامل

The equational theories of representable residuated semigroups

We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We survey related results.

متن کامل

The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable

An ordered monoid is a structure with an identity element (1′), a binary composition operator (;) and an antisymmetric partial order (≤), satisfying certain axioms. A representation of an ordered monoid is a 1-1 map which maps elements of an ordered monoid to binary relations in such a way that 1′ is mapped to the identity relation, ; corresponds to composition of binary relations and ≤ corresp...

متن کامل

Left Adequate and Left Ehresmann Monoids Ii

This article is the second of two presenting a new approach to left adequate monoids. In the first, we introduced the notion of being T -proper, where T is a submonoid of a left adequate monoid M . We showed that the free left adequate monoid on a set X is X∗-proper. Further, any left adequate monoid M has an X∗-proper cover for some set X , that is, there is an X∗proper left adequate monoid M̂ ...

متن کامل

Ehresmann monoids

Ehresmann monoids form a variety of biunary monoids, that is, monoids equipped with two basic unary operations, the images of which coincide and form a semilattice of projections. The monoid of binary relations BX on any setX with unary operations of domain and range is Ehresmann. Inverse monoids, regarded as biunary submonoids of BX via the Wagner-Preston representation theorem, are therefore ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006